package org.yimon.tool.algo.leetcode;

/**
 * @author: ym.gao
 * @description: 打家劫舍问题
 * @date: 2024/8/20 下午2:54
 */
public class LeetCode_198_Rob {

    public static void main(String[] args) {
        LeetCode_198_Rob rob = new LeetCode_198_Rob();
        System.out.println(rob.rob(new int[]{1, 2, 3, 1}));
    }

    public int rob(int[] nums) {
        if (nums == null || nums.length < 1) {
            return 0;
        }
        if (nums.length == 1) {
            return nums[0];
        }
        if (nums.length == 2) {
            return Math.max(nums[0], nums[1]);
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1], nums[i] + dp[i - 2]);
        }
        return dp[nums.length - 1];
    }
}
